Equivalence Problems for Tree Transducers: A Brief Survey
نویسنده
چکیده
The decidability of equivalence for three important classes of tree transducers is discussed. Each class can be obtained as a natural restriction of deterministic macro tree transducers (MTTs): (1) no context parameters, i.e., top-down tree transducers, (2) linear size increase, i.e., MSO definable tree transducers, and (3) monadic input and output ranked alphabets. For the full class of MTTs, decidability of equivalence remains a long-standing open problem.
منابع مشابه
Ambiguity, Valuedness and Costs
This survey reports results on the ambiguity of nite tree automata, the valuedness of bottom{up nite state tree transducers and boundedness of cost automata. 0 Introduction Ambiguity, valuedness and maximal cost are diierent measures on the behaviour of nite state devices. The ambiguity of an automaton is the least upper bound on the number of diierent accepting computations for a given input. ...
متن کاملOn the Equivalence Problem for Letter-to-Letter Top-Down Tree Transducers
Letter to letter top-down tree transducers are investigated in this paper. Informally, trees which appear in the rules of such transducers are reduced to one letter in the right-hand side as in the left one. With an encoding of the tree transformations induced by such transducers into recognizable forests, we recently established the decidability of equivalence for linear top-down transducers. ...
متن کاملDecision Problems of Tree Transducers with Origin
A tree transducer with origin translates an input tree into a pair of output tree and origin info. The origin info maps each node in the output tree to the unique input node that created it. In this way, the implementation of the transducer becomes part of its semantics. We show that the landscape of decidable properties changes drastically when origin info is added. For instance, equivalence o...
متن کاملEquivalence of Extended Symbolic Finite Transducers
Symbolic Finite Transducers augment classic transducers with symbolic alphabets represented as parametric theories. Such extension enables succinctness and the use of potentially infinite alphabets while preserving closure and decidability properties. Extended Symbolic Finite Transducers further extend these objects by allowing transitions to read consecutive input elements in a single step. Wh...
متن کاملThe Equivalence Problem for Letter-to-Letter Bottom-up Tree Transducers is Solvable
Letter-to-letter bottom-up tree transducers are investigated in this paper. With an encoding of the so deened tree transformations into relabelings, we establish the decidability of equivalence for this class of tree transducers. Some extensions are next given.
متن کامل